Backdoors to Satisfaction
نویسندگان
چکیده
A backdoor set is a set of variables of a propositional formula such that fixing the truth values of the variables in the backdoor set moves the formula into some polynomial-time decidable class. If we know a small backdoor set we can reduce the question of whether the given formula is satisfiable to the same question for one or several easy formulas that belong to the tractable class under consideration. In this survey we review parameterized complexity results for problems that arise in the context of backdoor sets, such as the problem of finding a backdoor set of size at most k, parameterized by k. We also discuss recent results on backdoor sets for problems that are beyond NP.
منابع مشابه
Backdoors to Tractable Answer-Set Programming
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent “clever reasoning shortcuts” through the search space. The concept of backdoors is widely used in the areas of propositional satisfiability and constraint satisfaction. We show how this concept can be adapted to the nonm...
متن کاملAnswer Set Solver Backdoors
The concept of backdoor variables offers a generic notion for providing insights to the surprising success of constraint satisfaction solvers in solving remarkably complex real-world instances of combinatorial problems. We study backdoors in the context of answer set programming (ASP), and focus on studying the relative size of backdoors in terms of different state-of-the-art answer set solving...
متن کاملOn the Relationship Between Strong Backdoors and Instance Difficulty in Unsatisfiable Structured CSPs
The concept of backdoor was introduced by the SAT community to explain the computational performance of SAT solvers on large instances. There have been a number of investigations of backdoors for SAT since, but very little on the CSP side. This paper aims to correct this. In order to solve constraint satisfaction problems, a successful branching heuristic in constraint programming must be able ...
متن کاملBackdoors to the Tractability of Answer Set Programming
Reasoning problems of propositional disjunctive answer set programming, in particular Brave Reasoning and Skeptical Reasoning which ask whether a given atom is contained in at least one or in all answer sets, respectively, are computationally intractable, but can be solved efficiently for many real-world instances. We believe that the solvers exploit the presence of a “hidden structure”. My res...
متن کاملBackdoors in Satisfiability Problems
Although satisfiability problems (SAT) are NP-complete, state-of-the-art SAT solvers are able to solve large practical instances. The notion of backdoors has been introduced to capture structural properties of instances. Backdoors are a set of variables for which there exists some value assignment that leads to a polynomial-time solvable sub-problem. I address in this thesis the problem of find...
متن کاملBackdoor Treewidth for SAT
A strong backdoor in a CNF formula is a set of variables such that each possible instantiation of these variables moves the formula into a tractable class. The algorithmic problem of finding a strong backdoor has been the subject of intensive study, mostly within the parameterized complexity framework. Results to date focused primarily on backdoors of small size. In this paper we propose a new ...
متن کامل